Minimal consequence in sentential logic

Paraconsistent semantics for Pavelka style fuzzy sentential logic

1 The root of this work is on the one hand in Belnap’s four valued paraconsistent logic, and on the other hand on Pavelka’s papers further developed by Turunen. We do not introduce a new non–classical logic but, based on a related study of Perny and Tsoukiás, we introduce paraconsistent semantics of Pavelka style fuzzy sentential logic. Restricted to Lukasiewicz t–norm, our approach and the app...

Compiling Probabilistic Logic Programs into Sentential Decision Diagrams

Knowledge compilation algorithms transform a probabilistic logic program into a circuit representation that permits efficient probability computation. Knowledge compilation underlies algorithms for exact probabilistic inference and parameter learning in several languages, including ProbLog, PRISM, and LPADs. Developing such algorithms involves a choice, of which circuit language to target, and ...

Proof Search in Minimal Logic

General Logic-systems and Consequence Operators

In this paper, general logic-systems are investigated. It is shown that there are infinitely many finite consequence operators defined on a fixed language L that cannot be generated from any finite logicsystem. It is shown that any set map C:P(L) → P(L) is a finite consequence operator if and only if it is defined by a general logic-system.

Context and consequence. An intercontextual substructural logic

Some apparently valid arguments crucially rely on context change. To take a kind of example first discussed by Frege, ‘Tomorrow, it’ll be sunny’ taken on a day seems to entail ‘Today, it’s sunny’ taken on the next day, but the first sentence taken on a day sadly does not seem to entail the second sentence taken on the second next day. Mid-argument context change has not been accounted for by th...